Minimizing the average deviation of job completion times about a common due-date: An extension

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing weighted mean absolute deviation of job completion times from their weighted mean

We address a single-machine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their weighted mean. This problem and its precursors aim to achieve the maximum admissible level of service equity. It has been shown earlier that the unweighted version of this problem is NP-hard in the ordinary sense. For that version, a pseudo-po...

متن کامل

The complexity of scheduling job families about a common due date

Family scheduling problems are characterized by a setup time structure where setups are only required between jobs from different families. We consider the problem of scheduling job families on parallel machines to minimize weighted deviation about a common due date. Various special cases of this problem have been considered in the literature. This note summarizes known complexity results and i...

متن کامل

Minimizing Average Weighted Completion Time

Sanjeev Khanna University of Pennsylvania 11.

متن کامل

Minimization of the Mean Absolute Deviation from a Common Due Date in a Two-machine Flowshop

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. Initially, a job scheduling algorithm that obtains an optimal schedule for a given job sequence is presented. This algorithm is used with a job insertion procedure to generate a group of heuristics that differ on the initial job sequencing rule. Computational...

متن کامل

Minimizing mean squared deviation of completion times with maximum tardiness constraint

We consider a nonpreemptive single-machine scheduling problem to minimize mean squared deviation of job completion times about a common due date with maximum tardiness constraint (MSD/Tmax problem), where the common due date is large enough so that it does not constrain the minimization of MSD. The MSD/Tmax problem is classi®ed into three cases according to the value of maximum allowable tardin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Modelling

سال: 1987

ISSN: 0270-0255

DOI: 10.1016/0270-0255(87)90069-8